A note on the learning automata based algorithms for adaptive parameter selection in PSO

PSO, like many stochastic search methods, is very sensitive to efficient parameter setting such that modifying a single parameter may cause a considerable change in the result. In this paper, we study the ability of learning automata for adaptive PSO parameter selection.We introduced two classes of learning automata based algorithms for adaptive selection of value for inertiaweight and acceleration coefficients. In the first class, particles of a swarm use the same parameter values adjusted by learning automata. In the second class, each particle has its own characteristics and sets its parameter values individually. In eywords: article swarm optimization earning automata arameter adaptation addition, for both classed of proposed algorithms, two approaches for changing value of the parameters has been applied. In first approach, named adventurous, value of a parameter is selected from a finite set while in the second approach, named conservative, value of a parameter either changes by a fixed amount or remains unchanged. Experimental results show that proposed learning automata based algorithms compared to other schemes such as SPSO, PSOIW, PSO-TVAC, PSOLP, DAPSO, GPSO, and DCPSO have the same or even higher ability to find better solutions. In addition, proposed algorithms converge me o i ii i to stopping criteria for so